منابع مشابه
Fixed Points of Finite Groups Acting on Generalised Thompson Groups
We study centralisers of finite order automorphisms of the generalised Thompson groups Fn,∞ and conjugacy classes of finite subgroups in finite extensions of Fn,∞. In particular we show that centralisers of finite automorphisms in Fn,∞ are either of type FP∞ or not finitely generated. As an application we deduce the following result about the Bredon type of such finite extensions: any finite ex...
متن کاملFinite reflection groups and graph norms
Given a graph H on vertex set {1, 2, · · · , n} and a function f : [0, 1] → R, define ‖f‖H := ∣∣∣∣∣ ∫ ∏ ij∈E(H) f(xi, xj)dμ |V (H)| ∣∣∣∣∣ 1/|E(H)| , where μ is the Lebesgue measure on [0, 1]. We say that H is norming if ‖·‖H is a semi-norm. A similar notion ‖·‖r(H) is defined by ‖f‖r(H) := ‖|f |‖H and H is said to be weakly norming if ‖·‖r(H) is a norm. Classical results show that weakly normin...
متن کاملConstructing Normalisers in Finite Soluble Groups
This paper describes algorithms for constructing a Hall n-subgroup H of a finite soluble group G and the normaliser No(H). If G has composition length n, then H and No(H ) can be constructed using O(n ~ log IGI) and O(n ~ log IGI) group multiplications, respectively. These algorithms may be used to construct other important subgroups such as Carter subgroups, system normalisers and relative sys...
متن کاملintersections of prefrattini subgroups in finite soluble groups
let $h$ be a prefrattini subgroup of a soluble finite group $g$. in the paper it is proved that there exist elements $x,y in g$ such that the equality $h cap h^x cap h^y = phi (g)$ holds.
متن کاملComputing automorphisms of finite soluble groups
There is a large collection of e ective algorithms for computing information about nite soluble groups. The success in computation with these groups is primarily due to a computationally convenient representation of them by means of (special forms of) power conjugate presentations. A notable omission from this collection of algorithms is an e ective algorithm for computing the automorphism grou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2014
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2013.12.012